翻訳と辞書 Words near each other ・ Aperahama Taonui ・ Aperam ・ Aperam South America ・ Aperanat ・ Aperantia ・ Apere River ・ Aperel ・ Aperfield ・ Apergy ・ Aperibeense Futebol Clube ・ Aperibé ・ Apericallia ・ Aperiodic (disambiguation) ・ Aperiodic finite state automaton ・ Aperiodic frequency ・ Aperiodic graph ・ Aperiodic semigroup ・ Aperiodic set of prototiles ・ Aperiodic tiling ・ Aperioptus ・ Aperiovula ・ Aperiovula adriatica ・ Aperiovula juanjosensii ・ Aperitif for Destruction ・ Aperlae ・ Aperol ・ Aperol Spritz ・ Aperregui ・ Aperschnalzen ・ Apert syndrome Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Aperiodic graph ： ウィキペディア英語版 Aperiodic graph In the mathematical area of graph theory, a directed graph is said to be aperiodic if there is no integer ''k'' > 1 that divides the length of every cycle of the graph. Equivalently, a graph is aperiodic if the greatest common divisor of the lengths of its cycles is one; this greatest common divisor for a graph ''G'' is called the ''period'' of ''G''. == Graphs that cannot be aperiodic == In any directed bipartite graph, all cycles have a length that is divisible by two. Therefore, no directed bipartite graph can be aperiodic. In any directed acyclic graph, it is a vacuous truth that every ''k'' divides all cycles (because there are no directed cycles to divide) so no directed acyclic graph can be aperiodic. And in any directed cycle graph, there is only one cycle, so every cycle's length is divisible by ''n'', the length of that cycle. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Aperiodic graph」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.